A $[k,k+1]$-Factor Containing A Given Hamiltonian Cycle
نویسندگان
چکیده
منابع مشابه
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle
We prove the following best possible result. Let k ≥ 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n ≥ 8k− 16 for even n and n ≥ 6k−13 for odd n. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any given Hamiltonian cycle C of G, G has a [k, k + 1]-factor containing C. Submitted: December 15, 1997; Accepted: November 27, 1...
متن کاملDegree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle
Let k ≥ 2 be an integer and G a 2-connected graph of order |G| ≥ 3 with minimum degree at least k. Suppose that |G| ≥ 8k − 16 for even |G| and |G| ≥ 6k − 13 for odd |G|. We prove that G has a [k, k + 1]-factor containing a given Hamiltonian cycle if max{degG(x), degG(y)} ≥ |G|/2 for each pair of nonadjacent vertices x and y in G. This is best possible in the sense that there exists a graph havi...
متن کاملAlmost regular multipartite tournaments containing a Hamiltonian path through a given arc
A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. If x is a vertex of a digraph D, then we denote by d(x) and d−(x) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is de6ned by ig(D) = max{d+(x); d−(x)} − min{d+(y); d−(y)} over all vertices x and y o...
متن کاملOn vertices enforcing a Hamiltonian cycle
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar gra...
متن کاملHow much does a Hamiltonian cycle weigh?
1. INTRODUCTION. A Hamiltonian cycle in a graph is a path in the graph which visits each vertex exactly once and returns to the starting vertex. Let í µí°¾ í µí± be a weighted complete graph with í µí± vertices. We define the weight of an edge as the square of the distance between two end points of the edge. The weight of a path í µí± is the sum of the weights of all edges in the path and de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1998
ISSN: 1077-8926
DOI: 10.37236/1436